\hypertarget{disjointset_8h}{}\section{src/set\+\_\+algorithms/disjoint\+\_\+set/disjointset.h File Reference}
\label{disjointset_8h}\index{src/set\+\_\+algorithms/disjoint\+\_\+set/disjointset.\+h@{src/set\+\_\+algorithms/disjoint\+\_\+set/disjointset.\+h}}
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include $<$vector$>$}\\*
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{struct_introduction_to_algorithm_1_1_set_algorithm_1_1_disjoint_set_node}{Introduction\+To\+Algorithm\+::\+Set\+Algorithm\+::\+Disjoint\+Set\+Node$<$ K\+Type $>$}
\begin{DoxyCompactList}\small\item\em Disjoint\+Set\+Node：不相交集合森林的节点，算法导论第21章21.3节 \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Introduction\+To\+Algorithm\+::\+Set\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_set_algorithm}{Set\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
